Phylogenetic Tree Construction for DNA Sequences using Clustering Methods
نویسندگان
چکیده
منابع مشابه
Phylogenetic Tree Construction for Y-DNA Haplogroups
Male Y-chromosome is currently used to estimate the paternal ancestry and migratory patterns of humans. Y-chromosomal Short Tandem Repeat(STR) segments provide important data for reconstructing phylogenetic trees. However, STR data is not widely used for phylogeny because there is not enough appropriate methodology. We propose a three-step method for analyzing large numbers of STR data and cons...
متن کاملUsing invariants for phylogenetic tree construction
Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical interest — they can be used to construct phylogenetic trees. This paper is a self-contained introduction to the algebraic, statistical, and computational ch...
متن کاملPhylogenetic tree construction of butyrylcholinesterase sequences in life forms.
Butyrylcholinesterase is an enzyme with few known physiological functions. It is related to acetylcholine that was shown to be expressed in a variety of life forms. We performed a search using the human butyrylcholinesterase gene (HGNC:983;MIM:177400), and found the sequence in a broad spectrum including plants, bacteria and animals. Therefore butyrylcholinesterase appears to have evolved early...
متن کاملMetric learning for phylogenetic tree construction
We introduce new methods for phylogenetic tree construction by using metric learning to optimize the power of phylogenetic invariants on trees with four leaves. Phylogenetic invariants are polynomials in the joint probabilities which vanish under a model of evolution on a phylogenetic tree. They have been used for tree construction with only partial success partly because a good scoring metric ...
متن کاملAlgorithms for efficient phylogenetic tree construction
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene duplications. This problem is NP-hard and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. These loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.06.169